An Unweighted, Undirected Example Graph

  • This simple graph, which we'll call 'U', is undirected (edges are two-way) and unweighted (all edges are equal).
  • It is defined by a set of vertices $V = \{A, B, C, D\}$ and a set of edges $E = \{\{A,B\}, \{A,C\}, \{B,D\}\}$.
  • In the next few slides, we will demonstrate how to represent this same graph using an edge list, an adjacency list, and an adjacency matrix.